A $ {BMAP/BMSP/1} $ queue with Markov dependent arrival and Markov dependent service batches

نویسندگان

چکیده

Batch arrival and batch service queueing systems are of importance in the context telecommunication networks. None work reported so far consider dependence consecutive batches. Batch Markovian Arrival Process(\begin{document}$ BMAP $\end{document}) Service Process (\begin{document}$ BMSP take care between successive inter-arrival times, respectively. However real life situations sizes also play an important role. This is to regulate workload server restrict size when flow from same source. In this paper we study a system with Markov dependent sizes. The assumed be finite. Further, time durations correlated. Specifically, \begin{document}$ BMAP/BMSP/1 $\end{document} queue stability investigated. steady state probability vectors some performance measures computed. Laplace-Stieltjes transform waiting idle obtained. Some numerical examples provided.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Queue Length Analysis of a Markov-modulated Vacation Queue with Dependent Arrival and Service Processes and Exhaustive Service Policy

The paper introduces a class of vacation queues where the arrival and service processes are modulated by the same Markov process, hence they can be dependent. The main result of the paper is the probability generating function for the number of jobs in the system. The analysis follows a matrix-analytic approach. A step of the analysis requires the evaluation of the busy period of a quasi birth ...

متن کامل

Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times

In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-known MAP/G/1 queue by allowing dependencies between interarrival and service times. The waiting time process is directly analyzed by solving Lindley’s equation by transform methods. The Laplace Stieltjes transforms (LST)...

متن کامل

Exhaustive vacation queue with dependent arrival and service processes

This paper presents a more general class of MAP/MAP/1 exhaustive vacation queue, in which the Markov modulated arrival and service processes are dependent. This model class requires the evaluation of the busy period of quasi birth death process with arbitrary initial level, which is a new analysis element. The model is analyzed by applying matrix analytic methods for the underlying quasi birth ...

متن کامل

A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers

In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2021

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2020101